Deduction Schemes for Association Rules
نویسنده
چکیده
Several notions of redundancy exist for Association Rules. Often, these notions take the form “any dataset in which this first rule holds must obey also that second rule, therefore the second is redundant”; if we see datasets as interpretations (or models) in the logical sense, this is a form of logical entailment. In many logics, entailment has a syntactic counterpart in the form of a deduction calculus. We provide such a deduction calculus for existing notions of redundancy; then, we consider a very general notion of entailment, where a confidence threshold is fixed and several rules can act as simultaneous premises, and identify exactly the cases where a partial rule follows from two partial rules; we also give a deduction calculus for this setting.
منابع مشابه
Extending Decidable Cases for Rules with Existential Variables
In ∀∃-rules, the conclusion may contain existentially quantified variables, which makes reasoning tasks (as deduction) non-decidable. These rules have the same logical form as TGD (tuplegenerating dependencies) in databases and as conceptual graph rules. We extend known decidable cases by combining backward and forward chaining schemes, in association with a graph that captures exactly the noti...
متن کاملExperience-based deductive learning
A method of deductive learning is proposed to con trol deductive inference Our goal is to improve prob lem solving time by experience when that experience monotonically adds knowledge to the knowledge base Accumulating and exploiting experience are done by the schemes of knowledge migration and knowledge shadowing Knowledge migration generates speci c migrated rules from general migrating rules...
متن کاملRedundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
Association rules are among the most widely employed data analysis methods in the field of Data Mining. An association rule is a form of partial implication between two sets of binary variables. In the most common approach, association rules are usually parameterized by a lower bound on their confidence, which is the empirical conditional probability of their consequent given the antecedent, an...
متن کاملApplying Domain Knowledge in Association Rules Mining Process - First Experience
First experiences with utilization of formalized items of domain knowledge in a process of association rules mining are described. We use association rules atomic consequences of items of domain knowledge and suitable deduction rules to filter out uninteresting association rules. The approach is experimentally implemented in the LISp–Miner system. PUBLISHED IN: Foundations of Intelligent System...
متن کاملDecorating proofs
We consider proofs in minimal logic, written in natural deduction style. The only rules are introduction and elimination for implication and the universal quantifier. The logical connectives ∃,∧ are seen as special cases of inductively defined predicates, and hence are defined by the introduction and elimination schemes ∀x(A→ ∃xA), ∃xA→ ∀x(A→ B)→ B (x not free in B), A→ B → A ∧B, A ∧B → (A→ B →...
متن کامل